Complexity bounds on supermesh construction for quasi-uniform meshes

Projecting fields between different meshes commonly arises in computational physics. This operation requires a supermesh construction and its computational cost is proportional to the number of cells of the supermesh $n$. Given any two quasi-uniform meshes of $n_A$ and $n_B$ cells respectively, we show under standard assumptions that n is proportional to $n_A + n_B$. This result substantially improves on the best currently available upper bound on $n$ and is fundamental for the analysis of algorithms that use supermeshes

Galerkin projection of discrete fields via supermesh construction

Interpolation of discrete FIelds arises frequently in computational physics. This thesis focuses on the novel implementation and analysis of Galerkin projection, an interpolation technique with three principal advantages over its competitors: it is optimally accurate in the L2 norm, it is conservative, and it is well-defined in the case of spaces of discontinuous functions. While these desirable properties have been known for some time, the implementation of Galerkin projection is challenging; this thesis reports the first successful general implementation. A thorough review of the history, development and current frontiers of adaptive remeshing is given. Adaptive remeshing is the primary motivation for the development of Galerkin projection, as its use necessitates the interpolation of discrete fields. The Galerkin projection is discussed and the geometric concept necessary for its implementation, the supermesh, is introduced. The efficient local construction of the supermesh of two meshes by the intersection of the elements of the input meshes is then described. Next, the element-element association problem of identifying which elements from the input meshes intersect is analysed. With efficient algorithms for its construction in hand, applications of supermeshing other than Galerkin projections are discussed, focusing on the computation of diagnostics of simulations which employ adaptive remeshing. Examples demonstrating the effectiveness and efficiency of the presented algorithms are given throughout. The thesis closes with some conclusions and possibilities for future work

Advanced space system analysis software. Technical, user, and programmer guide

The LASS computer program provides a tool for interactive preliminary and conceptual design of LSS. Eight program modules were developed, including four automated model geometry generators, an associated mass properties module, an appendage synthesizer module, an rf analysis module, and an orbital transfer analysis module. The existing rigid body controls analysis module was modified to permit analysis of effects of solar pressure on orbital performance. A description of each module, user instructions, and programmer information are included

Correction: assortative mating in fallow deer reduces the strength of sexual selection.

PMCID: PMC3182158 This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.This article corrects this one: PLoS One. 2011; 6(4): e18533. doi:10.1371/journal.pone.0018533[This corrects the article on p. e18533 in vol. 6.]

Deflation for semismooth equations

Variational inequalities can in general support distinct solutions. In this paper we study an algorithm for computing distinct solutions of a variational inequality, without varying the initial guess supplied to the solver. The central idea is the combination of a semismooth Newton method with a deflation operator that eliminates known solutions from consideration. Given one root of a semismooth residual, deflation constructs a new problem for which a semismooth Newton method will not converge to the known root, even from the same initial guess. This enables the discovery of other roots. We prove the effectiveness of the deflation technique under the same assumptions that guarantee locally superlinear convergence of a semismooth Newton method. We demonstrate its utility on various finite- and infinite-dimensional examples drawn from constrained optimization, game theory, economics and solid mechanics.Comment: 24 pages, 3 figure

Agricultural Precautionary Wealth

Using panel data, the relationship between income uncertainty and the stock of wealth through precautionary saving is examined. Evidence from Kansas data is consistent with the precautionary saving motive in that farm households facing greater uncertainty in income maintain larger stocks of wealth in order to smooth consumption. These results are found by regressing net worth against measures of permanent income (life-cycle income), measures of uncertainty, and demographic variables.precautionary saving, precautionary wealth, risk, Risk and Uncertainty,